--- Day 14: Reindeer Olympics --- This year is the Reindeer Olympics! Reindeer can fly at high speeds, but must rest occasionally to recover their energy. Santa would like to know which of his reindeer is fastest, and so he has them race. Reindeer can only either be flying (always at their top speed) or resting (not moving at all), and always spend whole seconds in either state. For example, suppose you have the following Reindeer: Comet can fly 14 km/s for 10 seconds, but then must rest for 127 seconds. Dancer can fly 16 km/s for 11 seconds, but then must rest for 162 seconds. After one second, Comet has gone 14 km, while Dancer has gone 16 km. After ten seconds, Comet has gone 140 km, while Dancer has gone 160 km. On the eleventh second, Comet begins resting (staying at 140 km), and Dancer continues on for a total distance of 176 km. On the 12th second, both reindeer are resting. They continue to rest until the 138th second, when Comet flies for another ten seconds. On the 174th second, Dancer flies for another 11 seconds. In this example, after the 1000th second, both reindeer are resting, and Comet is in the lead at 1120 km (poor Dancer has only gotten 1056 km by that point). So, in this situation, Comet would win (if the race ended at 1000 seconds). Given the descriptions of each reindeer (in your puzzle input), after exactly 2503 seconds, what distance has the winning reindeer traveled?



In [44]:

    
import re
from collections import defaultdict

PARSE = re.compile("([A-Za-z]+) can fly ([0-9]+) km/s for ([0-9]+) seconds, but then must rest for ([0-9]+) seconds.")

def load_speeds(rules):
    speeds = {}
    for rule in rules:
        reindeer, speed, moving, resting = PARSE.match(rule).groups()
        speeds[reindeer] = (int(speed), int(moving), int(resting))
    return speeds

def calculate_distance(seconds, values):
    speed, moving, resting = values
    full_cycles = seconds // (moving + resting)
    rest_seconds = seconds % (moving + resting)    
    return full_cycles*moving*speed + min(rest_seconds, moving)*speed

def get_distance_winners(seconds, speeds):
    winners = []
    max_distance = 0
    for r in speeds:
        distance = calculate_distance(seconds, speeds[r])
        
        if distance == max_distance:
            winners.append(r)
        elif distance > max_distance:
            winners = [r]
            max_distance = distance
    return max_distance, winners



In [42]:

    
# Test example
examples = [
    "Comet can fly 14 km/s for 10 seconds, but then must rest for 127 seconds.", 
    "Dancer can fly 16 km/s for 11 seconds, but then must rest for 162 seconds."
]

get_distance_winners(1000, load_speeds(examples))









    Out[42]:





(1120, ['Comet'])



In [43]:

    
# Real data
with open('day14/input.txt', 'rt') as fd:
    print(get_distance_winners(2503, load_speeds(fd)))









    



(2696, ['Cupid'])

--- Part Two --- Seeing how reindeer move in bursts, Santa decides he's not pleased with the old scoring system. Instead, at the end of each second, he awards one point to the reindeer currently in the lead. (If there are multiple reindeer tied for the lead, they each get one point.) He keeps the traditional 2503 second time limit, of course, as doing otherwise would be entirely ridiculous. Given the example reindeer from above, after the first second, Dancer is in the lead and gets one point. He stays in the lead until several seconds into Comet's second burst: after the 140th second, Comet pulls into the lead and gets his first point. Of course, since Dancer had been in the lead for the 139 seconds before that, he has accumulated 139 points by the 140th second. After the 1000th second, Dancer has accumulated 689 points, while poor Comet, our old champion, only has 312. So, with the new scoring system, Dancer would win (if the race ended at 1000 seconds). Again given the descriptions of each reindeer (in your puzzle input), after exactly 2503 seconds, how many points does the winning reindeer have?



In [55]:

    
def get_points_winners(seconds, speeds):
    points = defaultdict(int)    
    for s in range(1, seconds+1):
        distance, winners = get_distance_winners(s, speeds)  
        for w in winners:
            points[w] += 1
    
    winners = []
    max_points = 0
    for r, p in points.items():
        if p == max_points:
            winners.append(r)
        elif p > max_points:
            winners = [r]
            max_points = p
    
    return max_points, winners



In [56]:

    
# Test example
get_points_winners(1000, load_speeds(examples))









    Out[56]:





(689, ['Dancer'])



In [57]:

    
# Real data
with open("day14/input.txt", "rt") as fd:
    print(get_points_winners(2503, load_speeds(fd)))









    



(1084, ['Rudolph'])



In [ ]: